Differential Subsampling with Cartesian Ordering (DISCO): a novel k-space ordering scheme for dynamic MRI
نویسندگان
چکیده
Purpose: Dynamic contrast enhanced MRI (DCEMRI) and MR angiography (MRA) are both beset by the conflicting requirements of spatial and temporal resolution. Various schemes have been proposed and evaluated for high spatio-temporal resolution MR imaging [1-4]. They all incorporate combinations of partial Fourier imaging, sub-sampling, view sharing and parallel imaging to effect acceleration. The underlying k-space sampling scheme in these methods is generally Cartesian, radial or “radial-like”. We propose DISCO (DIfferential Subsampling with Cartesian Ordering), a flexible k-space segmentation scheme that minimizes sensitivity to eddy currents and motion for dynamic imaging while dispersing artifacts and residual ghosting and demonstrate its use in first pass contrast enhanced liver imaging.
منابع مشابه
DIfferential Subsampling with Cartesian Ordering (DISCO): a high spatio-temporal resolution Dixon imaging sequence for multiphasic contrast enhanced abdominal imaging.
PURPOSE To develop and evaluate a multiphasic contrast-enhanced MRI method called DIfferential Sub-sampling with Cartesian Ordering (DISCO) for abdominal imaging. MATERIALS AND METHODS A three-dimensional, variable density pseudo-random k-space segmentation scheme was developed and combined with a Dixon-based fat-water separation algorithm to generate high temporal resolution images with robu...
متن کاملk-t SPARSE: High frame rate dynamic MRI exploiting spatio-temporal sparsity
M. Lustig, J. M. Santos, D. L. Donoho, J. M. Pauly Electrical Engineering, Stanford University, Stanford, CA, United States, Statistics, Stanford University, Stanford, CA, United States Introduction Recently rapid imaging methods that exploit the spatial sparsity of images using under-sampled randomly perturbed spirals and non-linear reconstruction have been proposed [1,2]. These methods were i...
متن کاملRestricting the parameter set of the Pascoletti-Serafini scalarization
A common approach to determine efficient solutions of a multiple objective optimization problem is reformulating it to a parameter dependent scalar optimization problem. This reformulation is called scalarization approach. Here, a well-known scalarization approach named Pascoletti-Serafini scalarization is considered. First, some difficulties of this scalarization are discussed and then ...
متن کاملDynamic Inventory Planning with Unknown Costs and Stochastic Demand
Generally ordering policies are done by two methods, including fix order quantity (FOQ) and fix order period (FOP). These methods are static and either the quantity of ordering or the procedure of ordering is fixing in throughout time horizon. In real environments, demand is varying in any period and may be considered as uncertainty. When demand is variable in any period, the traditional and st...
متن کاملRepeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کامل